Sightseeing Route Planning
نویسندگان
چکیده
Route planning is a challenging task because it is a combination of theoretically well-defined computational problems on one side, and everyday-life decisions and constraints on the other side. This paper presents an approach to sightseeing route planning using theory of computation. In particular, in this paper we discuss the combination of two well-known computational problems: knapsack and travelling salesman, and their practical implementation in everyday life task ‒ route planning. The algorithms are adapted in such way that they find near optimal solution with minimum delay, almost in real-time. The final result of the algorithms is a suggested list of tourist attractions ordered by their location and attractiveness.
منابع مشابه
Tour Planning for Sightseeing with Time-Dependent Satisfactions of Activities and Traveling Times
This paper proposes a new personal tour planning problem with time-dependent satisfactions, traveling and activity duration times for sightseeing. It is difficult to represent the time-dependent model using general static network models, and hence, Time-Expanded Network (TEN) is introduced. The TEN contains a copy to the set of nodes in the underlying static network for each discrete time step,...
متن کاملHeuristics for the time dependent team orienteering problem: Application to tourist route planning
The Time Dependent Team Orienteering Problem with Time Windows (TDTOPTW) can be used to model several real life problems. Among them, the route planning problem for tourists interested in visiting multiple points of interest (POIs) using public transportation. The main objective of this problem is to select POIs that match tourist preferences, taking into account a multitude of parameters and c...
متن کاملPersonalized Sightseeing Tours Support Using Mobile Devices
In this paper, we present PSiS (Personalized Sightseeing Tours Recommendation System) Mobile. PSiS Mobile is our proposal to a mobile recommendation and planning support system, which is designed to provide effective support during the tourist visit with context-aware information and recommendations about places of interest (POI), exploiting tourist preferences and context.
متن کاملA survey on algorithmic approaches for solving tourist trip design problems
The tourist trip design problem (TTDP) refers to a route-planning problem for tourists interested in visiting multiple points of interest (POIs). TTDP solvers derive daily tourist tours, i.e., ordered visits to POIs, which respect tourist constraints and POIs attributes. The main objective of the problem discussed is to select POIs that match tourist preferences, thereby maximizing tourist sati...
متن کاملeCO-friendly urban Multi-modal route PlAnning Services for mobile uSers
This study deals with the problem of deriving personalised recommendations for daily sightseeing itineraries for tourists visiting any destination. The authors’ approach considers selected places of interest that a traveller would potentially wish to visit and derives a near-optimal itinerary for each day of visit; the places of potential interest are selected based on stated or implied user pr...
متن کامل